Adaptive testing of a deterministic implementation against a nondeterministic nite state machine

نویسنده

  • R M Hierons
چکیده

A number of authors have looked at the problem of deriving a checking experiment from a nondeterministic nite state machine that mod els the required behaviour of a system We show that these methods can be extended if it is known that the implementation is equivalent to some unknown deterministic nite state machine When testing a deterministic implementation the test output provides information about the implementation under test and can thus guide future testing The use of an adaptive test process is thus proposed

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive Testing of a Deterministic Implementation Against a Nondeterministic Finite State Machine

A number of authors have looked at the problem of deriving a checking experiment from a nondeterministic finite state machine that models the required behaviour of a system. We show that these methods can be extended if it is known that the implementation is equivalent to some (unknown) deterministic finite state machine. When testing a deterministic implementation, the test output provides inf...

متن کامل

Instruction Computation in Subset Construction 1

Subset construction is the method of converting a nondeterministic nite-state machine into a deterministic one. The process of determinization is an important one in any implementation of nite-state machines since nondeterministic machines are often easier to describe than their deterministic equivalents and the conversion of regular expressions to nite-state machines usually produces nondeterm...

متن کامل

Generating Candidates When Testing a Deterministic Implementation against a Non-deterministic Finite-state Machine

This paper considers the problem of testing a deterministic system against a non-deterministic finite-state machine. An adaptive test process, with two phases, is proposed. The paper focuses on the first stage which involves testing to generate a candidate deterministic finite-state machine. This candidate has the property that, under the test hypotheses used, the implementation is correct if a...

متن کامل

Testing deterministic implementations from nondeterministic FSM specifications

In this paper, conformance testing of protocols specified as nondeterministic finite state machines is considered. Protocol implementations are assumed to be deterministic. In this testing scenario, the conformance relation becomes a preorder, so-called reduction relation between FSMs. The reduction relation requires that an implementation machine produces a (sub)set of output sequences that ca...

متن کامل

Space Complexity of Linear Time Approximate String Matching

Approximate string matching is a sequential problem and therefore it is possible to solve it using nite automata. Nondeterministic nite automata are constructed for string matching with k mismatches and k di erences. The corresponding deterministic nite automata are base for approximate string matching in linear time. Then the space complexity of both types of deterministic automata is calculat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998